CSP-DHIES: a new public-key encryption scheme from matrix conjugation

نویسندگان

  • Ping Pan
  • Lihua Wang
  • Licheng Wang
  • Lixiang Li
  • Yixian Yang
چکیده

We propose a new public-key cryptosystem named conjugacy search problem-based Diffie–Hellman integrated encryption scheme (CSP-DHIES), by using conjugation-related assumptions for a special monoid of matrices of truncated multi-variable polynomials over the ring Z12 where the CSP is assumed to be intractable. Our construction can be viewed as the first noncommunicative variant of the well-known DHIES cryptosystem. Under the assumptions of the intractability of the CSP-based hash Diffie–Hellman problem and the CSP-based oracle Diffie–Hellman problem, our scheme is provably secure against both chosenplaintext attacks and secure against chosen-ciphertext attacks. Our proofs are constructed in the standard model. We also discuss the possibility of implementing our proposal using braid groups. Copyright © 2011 John Wiley & Sons, Ltd.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Public-Key Encryption Scheme with Pseudo-random Ciphertexts

This work presents a practical public-key encryption scheme that offers security under adaptive chosen-ciphertext attack (CCA) and has pseudo-random ciphertexts, i.e. ciphertexts indistinguishable from random bit strings. Ciphertext pseudo-randomness has applications in steganography. The new scheme features short ciphertexts due to the use of elliptic curve cryptography, with ciphertext pseudo...

متن کامل

An efficient hybrid encryption in standard model

We proposed an efficient hybrid encryption scheme which is secure against chosen cipher-text attack in standard model. Our scheme is a simplified version of K. Kurosawa and Y. Desmedt’s scheme. The new scheme is very similar to DHIES, while our scheme is secure against chosen cipher-text attack under decision Diffie-Hellman assumption and DHIES is secure against chosen cipher-text attack under ...

متن کامل

Project Writeup Stateful Public-Key Cryptosystems: How to Encrypt with One 160-bit Exponentiation

The cost of computations on the discrete-exponentiation is getting serious in public key cryptography. It would be the barrier that prevents applying public key cryptography to some situation that the portable electronic devices are widely used, like cell phones. To adress this problem, this paper propose a new stateful public-key scheme that lets senders be stateful to accelerate the speed of ...

متن کامل

One-Pass HMQV and Asymmetric Key-Wrapping

Consider the task of asymmetric key-wrapping, where a key-management server encrypts a cryptographic key under the public key of a client. When used in storage and access-control systems, it is often the case that the server has no knowledge about the client (beyond its public key) and no means of coordinating with it. For example, a wrapped key used to encrypt a backup tape may be needed many ...

متن کامل

DHIES: An encryption scheme based on the Diffie-Hellman Problem

This paper describes a Diffie-Hellman based encryption scheme, DHIES (formerly named DHES and DHAES), which is now in several (draft) standards. The scheme is as efficient as ElGamal encryption, but has stronger security properties. Furthermore, these security properties are proven to hold under appropriate assumptions on the underlying primitive. DHIES is a Diffie-Hellman based scheme that com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Security and Communication Networks

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2012